منابع مشابه
Flexible Kernel Memory
This paper introduces a new model of associative memory, capable of both binary and continuous-valued inputs. Based on kernel theory, the memory model is on one hand a generalization of Radial Basis Function networks and, on the other, is in feature space, analogous to a Hopfield network. Attractors can be added, deleted, and updated on-line simply, without harming existing memories, and the nu...
متن کاملMemory Efficient Kernel Approximation
Scaling kernel machines to massive data sets is a major challenge due to storage and computation issues in handling large kernel matrices, that are usually dense. Recently, many papers have suggested tackling this problem by using a low-rank approximation of the kernel matrix. In this paper, we first make the observation that the structure of shift-invariant kernels changes from low-rank to blo...
متن کاملShape Classification Using a Flexible Graph Kernel
The medial axis being an homotopic transformation, the skeleton of a 2D shape corresponds to a planar graph having one face for each hole of the shape and one node for each junction or extremity of the branches. This graph is non simple since it can be composed of loops and multiple-edges. Within the shape comparison framework, such a graph is usually transformed into a simpler structure such a...
متن کاملFlexible Physical Memory Management
This paper presents a variety of memory management systems, ranging from virtual memory to file systems and databases. The diverse needs of a broad range of clients have caused each of these systems to provide some kind of flexible memory management. These systems are described and examined for common facilities and requirements. Finally, an analysis of the systems’ similarities leads to a disc...
متن کاملFlexible memory networks.
Networks of neurons in some brain areas are flexible enough to encode new memories quickly. Using a standard firing rate model of recurrent networks, we develop a theory of flexible memory networks. Our main results characterize networks having the maximal number of flexible memory patterns, given a constraint graph on the network's connectivity matrix. Modulo a mild topological condition, we f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLoS ONE
سال: 2010
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0010955